The Complexity of Some Topological Inference Problems

نویسنده

  • Shmuel Weinberger
چکیده

We give some lower bounds on the description, sample, and computational complexities of the problems of computing dimension, homology, and topological type of a manifold, and detecting singularities for a polyhedron.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spatial Logic and the Complexity of Diagrammatic Reasoning

Researchers have sought to explain the observed \eecacy" of diagrammatic reasoning (DR) via the notions of \limited abstraction" and inexpressivity 17, 20]. We argue that application of the concepts of computational complexity to systems of dia-grammatic representation is necessary for the evaluation of precise claims about their eecacy. We show here how to give such an analysis. Centrally, we ...

متن کامل

Grigni: [7] Topological Inference

Geographical database systems deal with certain basic topological relations such as \A overlaps B" and \B contains C" between simply connected regions in the plane. It is of great interest to make sound inferences from elementary statements of this form. This problem has been identi ed extensively in the recent literature, but very limited progress has been made towards addressing the considera...

متن کامل

Voting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems

some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...

متن کامل

Voting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems

some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...

متن کامل

Electricity Load Forecasting by Combining Adaptive Neuro-fuzzy Inference System and Seasonal Auto-Regressive Integrated Moving Average

Nowadays, electricity load forecasting, as one of the most important areas, plays a crucial role in the economic process. What separates electricity from other commodities is the impossibility of storing it on a large scale and cost-effective construction of new power generation and distribution plants. Also, the existence of seasonality, nonlinear complexity, and ambiguity pattern in electrici...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Foundations of Computational Mathematics

دوره 14  شماره 

صفحات  -

تاریخ انتشار 2014